A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
نویسندگان
چکیده
We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an overlapping branch and bound algorithm for convex constrained global optimization. Unlike other branch and bound algorithms, lower bounds are obtained via nonconvex underestimators of the function. For a numerical example, we apply the proposed branch and bound algorithm to radial basis function approximations. 1 School of Mathematics, The King’s Buildings, University of Edinburgh, EH9 3JZ, Scotland, EU. Email: [email protected] . Current reports available from “http://www.maths.ed.ac.uk/ERGO/preprints.html”. 2 This research was supported through an EPSRC Industrial CASE studentship at the University of Oxford in conjunction with Schlumberger. 3 Computational Science and Engineering Department, Rutherford Appleton Laboratory, Chilton, Oxfordshire, OX11 0QX, England, EU. Email: [email protected] . Current reports available from “http://www.numerical.rl.ac.uk/reports/reports.shtml”. 4 This work was supported by the EPSRC grants EP/E053351/1, EP/F005369/1 and EP/I013067/1. 5 Mathematical Institute, 24-29 St Giles’, University of Oxford, OX1 3LB, England, EU. Email: [email protected] . Computational Science and Engineering Department Atlas Centre Rutherford Appleton Laboratory Oxfordshire OX11 0QX 1st November 2011 Branch and Bound Global Optimization of Hessian Lipschitz Continuous Functions 1
منابع مشابه
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
We present improvements to branch and bound techniques for globally optimizing functions with Lipschitz continuity properties by developing novel bounding procedures and parallelisation strategies. The bounding procedures involve nonconvex quadratic or cubic lower bounds on the objective and use estimates of the spectrum of the Hessian or derivative tensor, respectively. As the nonconvex lower ...
متن کاملAn always convergent algorithm for global mini- mization of univariate Lipschitz functions
We develop and analyze a bisection type global optimization algorithm for real Lipschitz functions. The suggested method combines the branch and bound method with an always convergent solver of nonlinear equations. The computer implementation and performance are investigated in detail.
متن کاملTools for Simplicial Branch and Bound in Interval Global Optimization∗
Most branch and bound (B&B) algorithms for continuous global optimization work with hyper-rectangles, although some work in the 1970’s dealt with simplexes. More recently, Žilinskas et al have considered branch and bound for Lipschitz optimization, giving examples of how symmetry can be used and how algorithms can be made efficient. Here, in the spirit of that work, we consider simplex-based br...
متن کاملA class of multi-agent discrete hybrid non linearizable systems: Optimal controller design based on quasi-Newton algorithm for a class of sign-undefinite hessian cost functions
In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Global Optimization
دوره 56 شماره
صفحات -
تاریخ انتشار 2013